/*************************************************************************
	> File Name: P2563.cpp
	> Author: yufangze
	> Mail: 2224590123@qq.com
	> Created Time: 2025-04-07 09:56:23
 ************************************************************************/

#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;

#define MAX_N 200

int prime[MAX_N + 5];
void init_prime() {
    for (int i = 2; i <= MAX_N; i++) {
        if (prime[i]) continue;
        prime[++prime[0]] = i;
        for (int j = i, I = MAX_N / i; j <= I; j++) {
            prime[i * j] = 1;
        }
    }
    return ;
}

int solve(int n) {
    vector<int> dp(n + 1);
    dp[0] = 1;
    for (int i = 1; i <= prime[0]; i++) {
        for (int j = prime[i]; j <= n; j++) {
            dp[j] += dp[j - prime[i]];
        }
    }
    return dp[n];
}

int main() {
    init_prime();
    int n;
    while (cin >> n) {
        cout << solve(n) << endl;
    }
    return 0;
}
